Computable absolutely Pisot normal numbers

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A computable absolutely normal Liouville number

We give an algorithm that computes an absolutely normal Liouville number. 1. The main result The set of Liouville numbers is {x ∈ R \Q : ∀k ∈ N, ∃q ∈ N, q > 1 and ||qx|| < q−k} where ||x|| = min{|x−m| : m ∈ Z} is the distance of a real number x to the nearest integer and other notation is as usual. Liouville’s constant, ∑ k≥1 10 −k!, is the standard example of a Liouville number. Though uncount...

متن کامل

An example of a computable absolutely normal number

The first example of an absolutely normal number was given by Sierpinski in 1916, twenty years before the concept of computability was formalized. In this note we give a recursive reformulation of Sierpinski’s construction which produces a computable absolutely normal number.

متن کامل

On univoque Pisot numbers

We study Pisot numbers β ∈ (1, 2) which are univoque, i.e., such that there exists only one representation of 1 as 1 = P n≥1 snβ −n, with sn ∈ {0, 1}. We prove in particular that there exists a smallest univoque Pisot number, which has degree 14. Furthermore we give the smallest limit point of the set of univoque Pisot numbers.

متن کامل

A polynomial-time algorithm for computing absolutely normal numbers

We give an algorithm to compute an absolutely normal number so that the first i digits in its binary expansion are obtained in time polynomial in i; in fact, just above quadratic. The algorithm uses combinatorial tools to control divergence from normality. Speed of computation is achieved at the sacrifice of speed of convergence to normality.

متن کامل

Computing Absolutely Normal Numbers in Nearly Linear Time

A real number x is absolutely normal if, for every base b ≥ 2, every two equally long strings of digits appear with equal asymptotic frequency in the base-b expansion of x. This paper presents an explicit algorithm that generates the binary expansion of an absolutely normal number x, with the nth bit of x appearing after npolylog(n) computation steps. This speed is achieved by simultaneously co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Acta Arithmetica

سال: 2018

ISSN: 0065-1036,1730-6264

DOI: 10.4064/aa8661-8-2017